New Developments in Proofs and Computations

نویسنده

  • HELMUT SCHWICHTENBERG
چکیده

It is a tempting idea to use formal existence proofs as a means to precisely and verifiably express algorithmic ideas. This is clearly possible for “constructive” proofs, which are informally understood via the BrouwerHeyting-Kolmogorov interpretation (BHK-interpretation for short). This interpretation of intuitionistic (and minimal) logic explains what it means to prove a logically compound statement in terms of what it means to prove its components; the explanations use the notions of construction and constructive proof as unexplained primitive notions. For prime formulas the notion of proof is supposed to be given. The clauses of the BHK-interpretation are:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Guide to Stochastic Löwner Evolution and its Applications

This article is meant to serve as a guide to recent developments in the study of the scaling limit of critical models. These new developments were made possible through the definition of the Stochastic Löwner Evolution (SLE) by Oded Schramm. This article opens with a discussion of Löwner’s method, explaining how this method can be used to describe families of random curves. Then we define SLE a...

متن کامل

The Analysis of the Developments in South West Asia Geopolitical Interests (Case study: Geopolitical Developments in Yemen)

Through intellectual and doctrinal foundations of the Muslim world that Islam is derived Admen, ideas and movements throughout history have always been transformational. Regional, and new developments anticipated in the gradual transformation of some kind of social reform and a new orientation in the field of social regeneration based Barmen various countries and peoples of the Islamic world ca...

متن کامل

Additive Proofs of Knowledge - A New Notion for Non-Interactive Proofs

This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identificatio...

متن کامل

Adding New Mathematical Functions and Statistical‎ Distributions in WinBUGS

‎WinBUGS is one of the usual softwares in computational Bayesian statistics‎, ‎which is used to fit Baysian models easily‎. ‎Although this software has usual mathematical functions and statistical distributions as built in functions‎, ‎sometimes it is necessary to include other functions and distributions in computations which is done by some tricks and indirectly‎. ‎By using WinBUGS developmen...

متن کامل

Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems

Using a metaprogramming technique and semialgebraic computations, we provide computer-based proofs for old and new cuttingplane theorems in Gomory–Johnson’s model of cut generating functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007